Discrete linear canonical transform computation by adaptive method

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sampling Rate Conversion in the Discrete Linear Canonical Transform Domain

Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...

متن کامل

Digital computation of the complex linear canonical transform.

An efficient algorithm for the accurate computation of the linear canonical transform with complex transform parameters and with complex output variable is presented. Sampling issues are discussed and the requirements for different cases given. Simulations are provided to validate the results.

متن کامل

Computation of the linear Schrodinger Energy levels by Sinc method

Computation of the Schrodinger equation energy levels is very important in physics. For example we can use these levels to calculate the absorption coefficient and light refraction in a material as well as calculation of the interband and intersubband transition energies. Density of states of the system can also be obtained by using the energy levels. Thereafter we can determine that the system...

متن کامل

Eigenfunctions of linear canonical transform

The linear canonical transform (the LCT) is a useful tool for optical system analysis and signal processing. It is parameterized by a 2 2 matrix . Many operations, such as the Fourier transform (FT), fractional Fourier transform (FRFT), Fresnel transform, and scaling operations are all the special cases of the LCT. In this paper, we will discuss the eigenfunctions of the LCT. The eigenfunctions...

متن کامل

A novel method for discrete fractional Fourier transform computation

Fractional Fourier transform (FRFT) is a generalization of Fourier transform, and it indicates a rotation of signal in the time-frequency plane[l). The FRFT has been widely successfully used in the many areas[l][2]. Because of the importance of FRFT, discrete fractional Fourier transform (DFRFT) becomes an important issue in recent years[3][4] [5][6]. In the development of DFRFT, the DFRFT has ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optics Express

سال: 2013

ISSN: 1094-4087

DOI: 10.1364/oe.21.018138